On Merging and Dividing Social Graphs
نویسندگان
چکیده
منابع مشابه
On merging and dividing of Barabási-Albert-graphs
The Barabási-Albert-model is commonly used to generate scale-free graphs, like social networks. To generate dynamics in these networks, methods for altering such graphs are needed. Growing and shrinking is done simply by doing further generation iterations or undo them. In our paper we present four methods to merge two graphs based on the Barabási-Albertmodel, and five strategies to reverse the...
متن کاملForking and Dividing in Henson Graphs
For n ≥ 3, define Tn to be the theory of the generic Kn-free graph, where Kn is the complete graph on n vertices. We prove a graph theoretic characterization of dividing in Tn, and use it to show that forking and dividing are the same for complete types. We then give an example of a forking and nondividing formula. Altogether, Tn provides a counterexample to a recent question of Chernikov and K...
متن کاملSocial Choice, Merging, and Elections
Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merging of structures in which it is possible to encode the preferences of sources [5, 4, 12–14, 1]. Information merging has much in common with the goals of social choice theory: to define operations reflecting the preferences of ...
متن کاملMerging percolation on Zd and classical random graphs: Phase transition
We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called “rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describe the phase diagram on ...
متن کاملMerging percolation on Z and classical random graphs: Phase transition
We study a random graph model which is a superposition of the bond percolation model on Zd with probability p of an edge, and a classical random graph G(n, c/n). We show that this model, being a homogeneous random graph, has a natural relation to the so-called ”rank 1 case” of inhomogeneous random graphs. This allows us to use the newly developed theory of inhomogeneous random graphs to describ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence and Soft Computing Research
سال: 2015
ISSN: 2083-2567
DOI: 10.1515/jaiscr-2015-0017